Prediction in Chaotic Environments Based on Weak Quadratic Classifiers
نویسندگان
چکیده
منابع مشابه
study of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
Majority Vote Based on Weak Classifiers
We present a two-class pattern recognition method through the majority vote which is based on weak classifiers. The weak classifiers are defined‘in terms of rectangular regions formed by the original training data. Tests on real and simulated data sets show that this classifier combination procedure can lead to a high accuracy.
متن کاملchaotic time series prediction using optimal fuzzy systems based on sequential quadratic programming-case study: gold price
this paper presents a fuzzy approach to the prediction of highly nonlinear timeseries.the optimized mamdani-type fuzzy system denoted sqp-flc is applied forthe input-output modeling of measured data. in order to tune fuzzy membershipfunctions, a sequential quadratic programming (sqp) method is employed. theproposed method is evaluated and validated on a highly complex time series, dailygold pri...
متن کاملBoosting-Based On-Road Obstacle Sensing Using Discriminative Weak Classifiers
This paper proposes an extension of the weak classifiers derived from the Haar-like features for their use in the Viola-Jones object detection system. These weak classifiers differ from the traditional single threshold ones, in that no specific threshold is needed and these classifiers give a more general solution to the non-trivial task of finding thresholds for the Haar-like features. The pro...
متن کاملChaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments
Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12101630